On optimal call admission control in resource-sharing system

نویسندگان

  • Eitan Altman
  • Tania Jiménez
  • Ger Koole
چکیده

In this paper, we consider call admission control of multiple classes without waiting room. We use event-based dynamic programming for our model. We show that sometimes the customer classes can be ordered: if it is optimal to accept a class, then to accept a more profitable class is optimal too. We demonstrate submodularity of the minimum cost for the 2-classes problem and establish some properties of optimal policies. Then we formulate a fluid model that allows us to study the optimal control for the large-capacity case. We show that in the case of same service time distributions, the control problem can be reduced to a model with a one-dimensional (1-D) state space, and a trunk reservation policy is optimal. We present numerical examples that validate our results.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptive call admission control and resource allocation in multi server wireless/cellular network

The ever increasing demand of the subscribers has put pressure on the capacity of wireless networks around the world. To utilize the scare resources, in the present paper we propose an optimal allocation scheme for an integrated wireless/cellular model with handoff priority and handoff guarantee services. The suggested algorithm optimally allocates the resources in each cell and dynamically adj...

متن کامل

Optimal Call Admission Control in Generalized Processor Sharing (GPS) Schedulers

Generalized Processor Sharing(GPS) is an idealized fluid discipline with a number of desirable properties. Its packetized version PGPS is considered to be a good choice as a packet scheduling discipline to guarantee Quality-of-Service in IP and ATM networks. The existing Connection Admission Control(CAC) frameworks for GPS result in a conservative resource allocation. We propose an Optimal CAC ...

متن کامل

On Optimal Call Admission Control in a Resource-Sharing System

In this paper we consider call admission control of multiple classes without waiting room. We use event-based dynamic programming for our model. We show that sometimes the customer classes can be ordered: if it is optimal to accept a class, then to accept a more profitable class is optimal too. We demonstrate submodularity of the minimum cost for the 2-classes problem and establish some propert...

متن کامل

Dynamic radio resource allocation for 3G and beyond mobile wireless networks

Next generation of wireless cellular networks aim at supporting a diverse range of multimedia services to mobile users with guaranteed quality of service (QoS). Resource allocation and call admission control (CAC) are key management functions in future 3G and 4G cellular networks, in order to provide multimedia applications to mobile users with QoS guarantees and efficient resource utilization....

متن کامل

Source Time Scale and Optimal Buffer/Bandwidth Trade-Off for Regulated Traffic in an ATM Node

In this paper, we study the problem of resource allocation and control for an ATM node with regulated traffic. Both guaranteed lossless service and statistical service with small loss probability are considered. We investigate the relationship between source characteristics and the buffer/bandwidth trade-off under both services. Our contributions are the following. For guaranteed lossless servi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Communications

دوره 49  شماره 

صفحات  -

تاریخ انتشار 2001